Fast Sparse Superposition Codes have Exponentially Small Error Probability for R < C

نویسندگان

  • Antony Joseph
  • Andrew R. Barron
چکیده

—For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. These codes are based on the statistical high-dimensional regression framework. The paper [IEEE Trans. Inform. Theory 55 (2012), 2541 – 2557] investigated decoding using the optimal maximum-likelihood decoding scheme. Here a fast decoding algorithm, called adaptive successive decoder, is developed. For any rate R less than the capacity C communication is shown to be reliable with exponentially small error probability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Superposition Codes: Fast and Reliable at Rates Approaching Capacity with Gaussian Noise

For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. Both encoding and decoding are computationally feasible. The codewords are linear combinations of subsets of vectors from a given dictionary, with the possible messages indexed by the choice of subset. An adaptive successive decoder is developed, with which communicati...

متن کامل

The Error Probability of Sparse Superposition Codes with Approximate Message Passing Decoding

Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a computationally efficient technique for decoding SPARCs, has been proven to be asymptotically capacity-achieving for the AWGN channel. In this paper, we refine the as...

متن کامل

Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices

In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover, the codes with sparse generating matrices reported in the lite...

متن کامل

An Improved Analysis of Least Squares Superposition Codes with Bernoulli Dictionary

For the additive white Gaussian noise channel with average power constraint, sparse superposition codes, proposed by Barron and Joseph in 2010, achieve the capacity. While the codewords of the original sparse superposition codes are made with a dictionary matrix drawn from a Gaussian distribution, we consider the case that it is drawn from a Bernoulli distribution. We show an improved upper bou...

متن کامل

Low-Density Parity-Check Codes: Constructions and Bounds

Low-density parity-check (LDPC) codes were introduced in 1962, but were almost forgotten. The introduction of turbo-codes in 1993 was a real breakthrough in communication theory and practice, due to their practical effectiveness. Subsequently, the connections between LDPC and turbo codes were considered, and it was shown that the latter can be described in the framework of LDPC codes. In recent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1207.2406  شماره 

صفحات  -

تاریخ انتشار 2012